Functional first order de definability of LRTp
نویسندگان
چکیده
The language LRTp is a non-deterministic language for exact real number computation. It has been shown that all computable first order relations in the sense of Brattka are definable in the language. If we restrict the language to single-valued total relations (e.g. functions), all polynomials are definable in the language. In this paper we show that the non-deterministic version of the limit operator, which allows to define all computable first order relations, when restricted to single-valued total inputs, produces single-valued total outputs. This implies that not only the polynomials are definable in the language but also all computable first order functions.
منابع مشابه
Functional first order definability of LRTP
The language LRTp is a non-deterministic language for exact real number computation. It has been shown that all computable first order relations in the sense of Brattka are definable in the language. If we restrict the language to single-valued total relations (e.g. functions), all polynomials are definable in the language. This paper is an expanded version of [12] in which we show that the non...
متن کاملCharacterizing Definability of Second-Order Generalized Quantifiers
We study definability of second-order generalized quantifiers. We show that the question whether a second-order generalized quantifier Q1 is definable in terms of another quantifier Q2, the base logic being monadic second-order logic, reduces to the question if a quantifier Q1 is definable in FO(Q2, <,+,×) for certain first-order quantifiers Q1 and Q2. We use our characterization to show new de...
متن کاملOn Definability in Multimodal Logic
Three notions of definability in multimodal logic are considered. Two are analogous to the notions of explicit definability and implicit definability introduced by Beth in the context of first-order logic. However, while by Beth’s theorem the two types of definability are equivalent for first-order logic, such an equivalence does not hold for multimodal logics. A third notion of definability, r...
متن کاملArithmetical definability over finite structures
Arithmetical definability has been extensively studied over the natural numbers. In this paper, we take up the study of arithmetical definability over finite structures, motivated by the correspondence between uniform and . We prove finite analogs of three classic results in arithmetical definability, namely that and TIMES can first-order define PLUS, that and DIVIDES can first-order define TIM...
متن کاملModal definability of first-order formulas with free variables and query answering
We present an algorithmically efficient criterion of modal definability for first-order existential conjunctive formulas with several free variables. Then we apply it to establish modal definability of some family of first-order ∀∃-formulas. Finally, we use our definability results to show that, in any expressive description logic, the problem of answering modally definable conjunctive queries ...
متن کامل